Speculation and Decentralized Scheduling
نویسندگان
چکیده
As clusters continue to grow in size and complexity, providing scalable and predictable performance is an increasingly important challenge. A crucial roadblock to achieving predictable performance is stragglers, i.e., tasks that take significantly longer than expected to run. At this point, speculative execution has been widely adopted to mitigate the impact of stragglers. However, speculation mechanisms are designed and operated independently of job scheduling when, in fact, scheduling a speculative copy of a task has a direct impact on the resources available for other jobs. In this work, we present Hopper, a job scheduler that is speculationaware, i.e., that integrates the tradeoffs associated with speculation into job scheduling decisions. We implement both centralized and decentralized prototypes of the Hopper scheduler and show that 50% (66%) improvements over state-of-the-art centralized (decentralized) schedulers and speculation strategies can be achieved through the coordination of scheduling and speculation. CCS Concepts Networks → Cloud computing; Computer systems organization → Distributed architectures;
منابع مشابه
A MULTI-OBJECTIVE DECENTRALIZED MULTIPLE CONSTRUCTION PROJECTS SCHEDULING PROBLEM CONSIDERING PERIODIC SERVICES AND ORDERING POLICIES
In decentralized construction projects, costs are mostly related to investment, material, holding, logistics, and other minor costs for implementation. For this reason, simultaneous planning of these items and appropriate scheduling of activities can significantly reduce the total costs of the project undertaken. This paper investigates the decentralized multiple construction projects schedulin...
متن کاملHopper: Decentralized Speculation-aware Cluster Scheduling at Scale – Public Review
The huge volume of data available today has led to interest in parallel processing on commodity clusters. Data analytics distributed frameworks such as Hadoop, Spark, or Pregel are designed for parallel processing of a large amount of data. These frameworks break a computation job into small tasks that run in parallel on multiple machines, and aim to scale to very large clusters of inexpensive ...
متن کاملAn Effective Approach to Job Scheduling in Decentralized Grid Environment
Scheduling of jobs and resource management are the important challenging work in a grid environment. Processing time minimization of the jobs arriving at any computer site in a grid system is one of the major objectives in the research area of computing. In this paper, we propose a decentralized grid system model as a collection of clusters. We then introduce a decentralized job scheduling algo...
متن کاملSpeculative Hedge: Regulating Compile-time Speculation against Proole Variations
Path-oriented scheduling methods, such as trace scheduling and hyperblock scheduling, use speculation to extract instruction-level parallelism from control-intensive programs. These methods predict important execution paths in the current scheduling scope using execution prooling or frequency estimation. Aggressive speculation is then applied to the important execution paths, possibly at the co...
متن کاملPerformance potentials of compiler-directed data speculation
Compiler-directed data speculation has been implemented on Itanium systems to allow for a compiler 10 move a load across a store even when the two operations are potentially aliased This not only breaks data dependency to reduce critical path length, but also allows a load to be scheduled far apart from its uses to hide cache miss latencies. However, the effectiveness of data speculation is aff...
متن کامل